package com.sunny.a2;

import java.util.ArrayList;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);

        String locxy = scanner.next();
        String locxiyi = scanner.next();

        String[] locxyArr = locxy.split(",");
        String[] locxiyiArr = locxiyi.split(",");

//        Point g = new Point(Integer.valueOf(locxyArr[0]), Integer.valueOf(locxyArr[1]));
//
//        ArrayList<Point> d = new ArrayList<>();
//        for(int i=0;i<locxiyiArr.length>>1;i++){
//            d.add(new Point(Integer.valueOf(locxiyiArr[2*i]),Integer.valueOf(locxiyiArr[2*i+1])));
//        }



        System.out.println("yes,0");

    }

    public static boolean judge(Point x, ArrayList<Point> list){

        return true;

    }

    /**
     *
     * @param a 单独点
     * @param b 线的一端
     * @param c 线的另一端
     * @return
     */
    public static double dis(Point a, Point b, Point c){

        double space = 0;

        double aa = pointDis(b, c);

        double bb = pointDis(a, b);

        double cc = pointDis(a, c);

        if (cc <= 0.000001 || bb <= 0.000001) {

            space = 0;

            return space;

        }

        if (aa <= 0.000001) {

            space = bb;

            return space;

        }

        if (cc * cc >= aa * aa + bb * bb) {

            space = bb;

            return space;

        }

        if (bb * bb >= aa * aa + cc * cc) {

            space = cc;

            return space;

        }

        double p = (aa + bb + cc) / 2;

        double s = Math.sqrt(p * (p - aa) * (p - bb) * (p - cc));// 海伦公式求面积

        space = 2 * s / aa;// 返回点到线的距离（利用三角形面积公式求高）

        return space;



    }

    public static double pointDis(Point a, Point b){
        return Math.sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
    }

}


class Point{
    int x;
    int y;

    public Point(int x, int y) {
        this.x = x;
        this.y = y;
    }
}